A Novel Meta-heuristic Algorithm for Numerical and Engineering Optimization Problems:Piranha Foraging Optimization Algorithm (PFOA)

نویسندگان

چکیده

This paper provides a novel meta-heuristic optimization algorithm for solving continuous problems efficiently in the field of numerical and engineering optimization: Piranha Foraging Optimization Algorithm (PFOA). The is inspired by flexible mobile foraging behaviour piranha swarm divides their behavior into three patterns: localized group attack, bloodthirsty cluster attack scavenging foraging, simulates above behaviors to construct two dynamic search processes exploration exploitation. PFOA uses strategies non-linear parameter control, population survival reverse evasion enable populations have better diversity at different stages help find solutions. To gain insight performance PFOA, visualization methods were used assess efficiency analyse impact characteristics modes, sensitivity parameters size on algorithm. was further tested with 27 CEC benchmark functions four real design problems, results compared 13 well-known meta-heuristics. Test based statistical such as box-line plots, Wilcoxon rank sum test Friedman multiple dimensions (30, 50, 100 fixed dimensions) show significant differences other algorithms that stable improvement. unique advantages terms equilibrium convergence speed can avoid getting trapped local optimum regions effectively solve complex spaces.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A NOVEL META-HEURISTIC ALGORITHM: TUG OF WAR OPTIMIZATION

This paper presents a novel population-based meta-heuristic algorithm inspired by the game of tug of war. Utilizing a sport metaphor the algorithm, denoted as Tug of War Optimization (TWO), considers each candidate solution as a team participating in a series of rope pulling competitions.  The  teams  exert  pulling  forces  on  each  other...

متن کامل

A Meta-heuristic Algorithm for Global Numerical Optimization Problems inspired by Vortex in fluid physics

One of the most important issues in engineering is to find the optimal global points of the functions used. It is not easy to find such a point in some functions due to the reasons such as large number of dimensions or inability to derive them from the function. Also in engineering modeling, we do not have the relationships of many functions, but we can input and output them as a black box. The...

متن کامل

SIZING OPTIMIZATION OF TRUSS STRUCTURES WITH NEWTON META-HEURISTIC ALGORITHM

This study is devoted to discrete sizing optimization of truss structures employing an efficient discrete evolutionary meta-heuristic algorithm which uses the Newton gradient-based method as its updating scheme and it is named here as Newton Meta-heuristic Algorithm (NMA). In order to enable the NMA population-based meta-heuristic to effectively explore the discrete design space, a term contain...

متن کامل

NEW META-HEURISTIC OPTIMIZATION ALGORITHM USING NEURONAL COMMUNICATION

A new meta-heuristic method, based on Neuronal Communication (NC), is introduced in this article. The neuronal communication illustrates how data is exchanged between neurons in neural system. Actually, this pattern works efficiently in the nature. The present paper shows it is the same to find the global minimum. In addition, since few numbers of neurons participate in each step of the method,...

متن کامل

FOA: ‘Following’ Optimization Algorithm for solving Power engineering optimization problems

These days randomized-based population optimization algorithms are in wide use in different branches of science such as bioinformatics, chemical physics andpower engineering. An important group of these algorithms is inspired by physical processes or entities’ behavior. A new approach of applying optimization-based social relationships among the members of a community is investigated in this pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2023

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2023.3267110